Algebraization of the Three-valued BCK-logic
نویسندگان
چکیده
In this paper a definition of n-valued system in the context of the algebraizable logics is proposed. We define and study the variety V3, showing that it is definitionally equivalent to the equivalent quasivariety semantics for the “Three-valued BCK-logic”. As a consequence we find an axiomatic definition of the above system. Mathematics Subject Classification: 03B50, 03G25, 06F35.
منابع مشابه
Polyadic Algebras over Nonclassical Logics
The polyadic algebras that arise from the algebraization of the first-order extensions of a SIC are characterized and a representation theorem is proved. Standard implicational calculi (SIC)’s were considered by H. Rasiowa [19] and include classical and intuitionistic logic and their various weakenings and fragments, the many-valued logics of Post and Lukasiewicz, modal logics that admit the ru...
متن کاملOn Interval-valued intuitionistic fuzzy (implicative and commutative) ideals of BCK- algebra
The aim of this paper is to apply the concept of interval-valued intuitionistic fuzzy set to implicative ideals and commutative ideals in BCK-algebras and introduced the new notion of interval-valued intuitionistic fuzzy implicative ideals in BCK-algebras and interval-valued intuitionistic fuzzy commutative ideals in BCK-algebras and related properties are investigated.
متن کاملClasses of Pseudo-BCK algebras -Part I
In this paper we study particular classes of pseudo-BCK algebras, bounded or not bounded, as pseudo-BCK(pP) algebras, pseudo-BCK(pP) lattices, pseudo-Hájek(pP) algebras and pseudo-Wajsberg algebras. We introduce new classes of pseudo-BCK(pP) lattices, we establish hierarchies and we give some examples. We work with left-defined algebras and we work with → and ; as primitive operations, not with...
متن کاملFantastic Ideals in BCI-Algebras
Processing of the certain information, especially inferences based on certain information. Is based on classical two-valued logic. Due to strict and complete logical foundation (classical logic), making inference levels. Thus, it is natural and necessary to attempt to establish some rational logic system as the logical foundation for uncertain information processing. It is evident that this kin...
متن کاملBoolean and Central Elements and Cantor-Bernstein Theorem in Bounded Pseudo-BCK-Algebras?
Georgescu and Iorgulescu [3] introduced pseudo-BCK-algebras (in a slightly different way) as a non-commutative generalization of BCK-algebras, in the sense that if →= , then the algebra (A,→, 1) is a BCK-algebra. Pseudo-BCK-algebras relate to (non-commutative) residuated lattices as BCK-algebras do to commutative residuated lattices; specifically, by [6], pseudoBCK-algebras are just the 〈→, , 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Log. Q.
دوره 48 شماره
صفحات -
تاریخ انتشار 2002